Abstraction and Modular Veriication of Innnite-state Reactive Systems ?

نویسندگان

  • Zohar Manna
  • Michael A. Col
  • Bernd Finkbeiner
  • Henny B. Sipma
چکیده

ion and Modular Veri cation of In nite-State Reactive Systems ? Zohar Manna, Michael A. Col on, Bernd Finkbeiner, Henny B. Sipma and Tom as E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal veri cation techniques for reactive systems using modularity and abstraction. Their use allows the veri cation of larger systems, and the incremental veri cation of systems as they are developed and re ned. In particular, we show how deductive veri cation tools, and the combination of nite-state model checking and abstraction, allow the veri cation of in nite-state systems featuring data types commonly used in software speci cations, including real-time and hybrid systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification by Augmented Finitary Abstraction

The paper deals with the proof method of veriication by nitary abstraction (vfa), which presents a feasible approach to the veriication of the temporal properties of (potentially innnite-state) reactive systems. The method consists of a two-step process by which, in a rst step, the system and its temporal speciica-tion are jointly abstracted into a nite-state system and a nite-state speciicatio...

متن کامل

Model Checking and Deduction for Innnite-state Systems

Two well-known approaches to the veriication of reactive systems are deductive veriication and model checking. After brieey reviewing them, we present deductive model checking, which combines these two approaches. The new procedure uses deduction to extend the classical tableau-based model checking algorithms to the case of innnite-state systems.

متن کامل

Step: Deductive-algorithmic Veriication of Reactive and Real-time Systems ?

The Stanford Temporal Prover, STeP, combines deductive methods with algorithmic techniques to verify linear-time temporal logic speciications of reactive and real-time systems. STeP uses veriication rules, veriication diagrams, automatically generated invariants, model checking, and a collection of decision procedures to verify nite-and innnite-state systems. computer-aided formal veriication o...

متن کامل

Diagram-based Formalisms for the Veriication of Reactive Systems in Cade-13 Workshop on Visual Reasoning

Graphical formalisms are an increasingly important component of our research on the spec-iication and veriication of reactive systems. We brieey describe diagram-based veriication methods we have developed for verifying temporal properties of innnite-state reactive systems, as well as for the incremental analysis and reenement of systems and speciications.

متن کامل

Modularization and Abstraction: The Keys to Practical Formal Verification

In spite of the impressive progress in the development of the two main methods for formal veriication of reactive systems { Model Checking (in particular symbolic) and Deductive Veriication, they are still limited in their ability to handle large systems. It is generally recognized that the only way these methods can ever scale up is by the extensive use of abstraction and modularization, which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998